The dimension of semialgebraic subdifferential graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The dimension of semialgebraic subdifferential graphs

A corollary of a celebrated theorem of Minty is that the subdifferential graph of a closed convex function on Rn has uniform local dimension n. In contrast, there exist nonconvex closed functions whose subdifferentials have large graphs. We consider how far Minty’s corollary extends to functions that are nonconvex but semi-algebraic. © 2011 Elsevier Ltd. All rights reserved.

متن کامل

The metric dimension and girth of graphs

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

متن کامل

On the Total Curvature of Semialgebraic Graphs

We define the total curvature of a semialgebraic graph Γ ⊂ R as an integral K(Γ) = R Γ dμ, where μ is a certain Borel measure completely determined by the local extrinsic geometry of Γ. We prove that it satisfies the Chern-Lashof inequality K(Γ) ≥ b(Γ), where b(Γ) = b0(Γ) + b1(Γ), and we completely characterize those graphs for which we have equality. We also prove the following unknottedness r...

متن کامل

Szeged Dimension and $PI_v$ Dimension of Composite Graphs

Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...

متن کامل

the metric dimension and girth of graphs

a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinear Analysis: Theory, Methods & Applications

سال: 2012

ISSN: 0362-546X

DOI: 10.1016/j.na.2011.07.040